Lollipop graph - Reference.org

On this page

Vertices m + n {\displaystyle m+n}

Edges ( m 2 ) + n {\displaystyle {\tbinom {m}{2}}+n}

Girth { ∞ m ≤ 2 3 otherwise {\displaystyle \left\{{\begin{array}{ll}\infty &m\leq 2\\3&{\text{otherwise}}\end{array}}\right.}

Properties connected

Notation L m , n {\displaystyle L_{m,n}}

Additional information

Lollipop graph

Type of graph consisting of a clique on m vertices and a path graph on n vertices, connected with a bridge

In the mathematical discipline of graph theory, the (m,n)-lollipop graph is a special type of graph consisting of a complete graph (clique) on m vertices and a path graph on n vertices, connected with a bridge.

The special case of the (2n/3,n/3)-lollipop graphs are known as graphs which achieve the maximum possible hitting time, cover time and commute time.

Related Image Collections Add Image

Profiles

1 Image

We don't have any YouTube videos related to Lollipop graph yet.

You can add one yourself here.

We don't have any PDF documents related to Lollipop graph yet.

You can add one yourself here.

We don't have any Books related to Lollipop graph yet.

You can add one yourself here.

We don't have any archived web articles related to Lollipop graph yet.

You can submit a link to a page to archive here.

References

Weisstein, Eric. "Lollipop Graph". Wolfram Mathworld. Wolfram MathWorld. Retrieved 19 August 2015. http://mathworld.wolfram.com/LollipopGraph.html ↩
Brightwell, Graham; Winkler, Peter (September 1990). "Maximum hitting time for random walks on graphs". Random Structures & Algorithms. 1 (3): 263–276. doi:10.1002/rsa.3240010303. /wiki/Graham_Brightwell ↩
Feige, Uriel (August 1995). "A tight upper bound on the cover time for random walks on graphs". Random Structures & Algorithms. 6: 51–54. CiteSeerX 10.1.1.38.1188. doi:10.1002/rsa.3240060106. /wiki/Uriel_Feige ↩
Jonasson, Johan (March 2000). "Lollipop graphs are extremal for commute times". Random Structures and Algorithms. 16 (2): 131–142. doi:10.1002/(SICI)1098-2418(200003)16:2<131::AID-RSA1>3.0.CO;2-3. /wiki/Doi_(identifier) ↩

See also

References